Edge Sensing-Enabled Multistage Hierarchical Clustering Deredundancy Algorithm in WSNs

نویسندگان

چکیده

Due to the defects caused by limited energy, storage capacity, and computing ability, increasing amount of sensing data has become a challenge in wireless sensor networks (WSNs). To decrease additional power consumption extend lifetime WSN, multistage hierarchical clustering deredundancy algorithm is proposed. In first stage, dual-metric distance employed, redundant nodes are preliminarily identified improved k -means obtain clusters similar nodes. Then, Gaussian hybrid classification presented implement similarity for edge second stage. third clustered randomly weighted deduplicate spatial correlation data. Detailed experimental results show that, compared with existing schemes, proposed can achieve better performance terms ratio, energy consumption, network lifetime.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy Degree Distance Clustering Algorithm for Wsns

Energy consumption is an important parameter in the context of the wireless sensor networks (WSNs). Several factors can cause energy over consumption such as mobility, node position (relay or gateway), retransmissions... In this paper, we described a new Energy-Degree Distance(EDD) Clustering Algorithm for the WSNs. A node with higher residual energy, higher degree and closer to the base statio...

متن کامل

Energy Aware Zone-based Clustering Algorithm in WSNs

Recent advances in the wireless sensor network introduction many protocols specially designed for sensor networks, different traffic models and energy efficiency techniques in Wireless Sensor Networks (WSN) so far. Most of the clustering protocols planned for the nodes are stationary. But, in applications like habitat monitoring those clustering mechanisms are invalid, so the static environment...

متن کامل

Hierarchical Clustering and Genetic Algorithm

The Traveling Salesman Problem(TSP) is one of the most intensively studied problem in computational mathematics. To solve this problem a number of algorithms have been developed using genetic algorithms. But these algorithms are not so suitable for solving large-scale TSP. This paper proposes a new solution for TSP using hierarchical clustering and genetic algorithm. Keywords— Traveling Salesma...

متن کامل

Dynamic Hierarchical Compact Clustering Algorithm

In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical agglomerative algorithms can be obtained, by specifying an inter-cluster similarity measure, a subgraph of the β-similarity graph, and a cover algorithm. A new clustering algorithm called Hierarchical Compact Algorithm and its ...

متن کامل

Gravitational Based Hierarchical Clustering Algorithm

We propose a new gravitational based hierarchical clustering algorithm using kdtree. kdtree generates densely populated packets and finds the clusters using gravitational force between the packets. Gravitational based hierarchical clustering results are of high quality and robustness. Our method is effective as well as robust. Our proposed algorithm is tested on synthetic dataset and results ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Communications and Mobile Computing

سال: 2021

ISSN: ['1530-8669', '1530-8677']

DOI: https://doi.org/10.1155/2021/6664324